On fillings of 2N-gons with rhombi
نویسنده
چکیده
da Silva, I.P.F, On fillings of ZN-gons with rhombi, Discrete Mathematics 111 (1993) 137-144. In the first part of this paper we give a generalization of a result of Ringel [ll] on simple arrangements of pseudolines. In terms of fillings with rhombi of an N-zonogon, we obtain a way of generating every filling from a given one by successively performing the same local transformation. In the second part we interpret, via oriented matroids, fillings of N-zonogons with rhombi as families of vectors in ZN. While for results in Section 1 the finiteness of the filling is essential, the aim of Section 2 is to strengthen the possibility already pointed out by Dress [7] of obtaining de Bruijn’s results [4] on Penrose tilings from a purely combinatorial point of view. Recalling some results A$lling with rhombi of a convex polygon P is a family 9 of rhombi such that (i) if R, R’E~ then either RnR’=@ or RnR’ is a face (vertex or edge) of both and R’, (4 URE.~R=P, (iii) the length of the edge of any rhombus FEN is 1. Given a filling 9 of a convex polygon P, for every rhombus REP;, with one edge contained in an edge e of P, the zone of R, ZR, is the ‘strip’ of rhombi constructed from R in the following way. Put R, = R, e, = enR and e, the edge of R parallel to eO, Z1 = RI. For i> 1 let Ri be the rhombus of 9 which verifies RinRi_ 1 =ei_ 1, define ei as the edge of Ri opposite to ei_1 and put Zi=Zi_luRi. Since P is a convex polygon, this procedure terminates at some stage n, R, being a rhombus with one edge contained in an edge e’ of P parallel to P. From the concept of zone (see [S]) we easily obtain a characterization of what convex polygons can be filled with rhombi: a convex polygon P can be jlled with Correspondence to: Ilda P.F. da Silva, CMAF/INIC, Av. Prof. Gama Pinto, No. 2, 1699 Lisboa Codex, Portugal. 0012-365X/93/$06.00
منابع مشابه
Multidimensional Impossible Polycubes
We first derive a 3-dimensional impossible polycube by forcibly deforming the projection of a 3-dimensional polycube. This procedure is extended into n(≥4)-space to construct n-dimensional impossible polycubes represented in 2or 3-space. They are useful as fundamental grid patterns for imaging various n-dimensional impossible figures in our 3-space. On 2-space, especially, each pattern can be c...
متن کاملVERY HOMOGENEOUS GENERALIZED n-GONS OF FINITE MORLEY RANK
(Almost strongly minimal) generalized n-gons are constructed for all n& 3 for which the automorphism group acts transitively on the set of ordered ordinary (n1)-gons contained in it, a new class of BN-pairs thus being obtained. Through the construction being modified slightly, 2! many non-isomorphic almost strongly minimal generalized n-gons are obtained for all n& 3, none of which interprets ...
متن کاملRhombus Tilings of a Hexagon with Three Missing Border Triangles
The interest in rhombus tilings has emerged from the enumeration of plane partitions in a given box (which was first carried out by MacMahon [5]). The connection comes from looking at the stacks of cubes of a plane partition from the right direction and projecting the picture to the plane. Then the box becomes a hexagon, where opposite sides are equal, and the cubes become a rhombus tiling of t...
متن کاملAdjacency preserving mappings
In a certain class of point-line geometries, called locally projective near polygons, which includes dual polar spaces and generalised 2n-gons, surjective adjacency preserving mappings are already collineations.
متن کاملExtended formulations for polygons
The extension complexity of a polytope P is the smallest integer k such that P is the projection of a polytope Q with k facets. We study the extension complexity of n-gons in the plane. First, we give a new proof that the extension complexity of regular n-gons is O(logn), a result originating from work by Ben-Tal and Nemirovski (Math. Oper. Res. 26(2), 193–205, 2001). Our proof easily generaliz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 111 شماره
صفحات -
تاریخ انتشار 1993